A Novel Fast Searching Algorithm Based on Least Square Regression
نویسندگان
چکیده
منابع مشابه
Fast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملA fast exact least mean square adaptive algorithm
We present a general block formulation of the least mean square (LMS) algorithm for adaptive filtering. This formulation has an exact equivalence with the original LMS algorithm, hence retaining the same convergence properties, while allowing a reduction in arithmetic complexity, even for very small block lengths. Working with small block lengths is very interesting from an implementation point...
متن کاملFUZZY LOGISTIC REGRESSION BASED ON LEAST SQUARE APPROACH AND TRAPEZOIDAL MEMBERSHIP FUNCTION
Logistic regression is a non-linear modification of the linearregression. The purpose of the logistic regression analysis is tomeasure the effects of multiple explanatory variables which can becontinuous and response variable is categorical. In real life there aresituations which we deal with information that is vague innature and there are cases that are not explainedprecisely. In this regard,...
متن کاملPartial Least Square Regression PLS-Regression
PLS regression is a recent technique that generalizes and combines features from principal component analysis and multiple regression. Its goal is to predict or analyze a set of dependent variables from a set of independent variables or predictors. This prediction is achieved by extracting from the predictors a set of orthogonal factors called latent variables which have the best predictive pow...
متن کاملA fast randomized algorithm for overdetermined linear least-squares regression.
We introduce a randomized algorithm for overdetermined linear least-squares regression. Given an arbitrary full-rank m x n matrix A with m >/= n, any m x 1 vector b, and any positive real number epsilon, the procedure computes an n x 1 vector x such that x minimizes the Euclidean norm ||Ax - b || to relative precision epsilon. The algorithm typically requires ((log(n)+log(1/epsilon))mn+n(3)) fl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue d'Intelligence Artificielle
سال: 2021
ISSN: 0992-499X,1958-5748
DOI: 10.18280/ria.350111